package zhwtest;


import java.beans.beancontext.BeanContext;
import java.io.PrintStream;
import java.security.PublicKey;
import java.util.HashSet;
import java.util.Scanner;
import java.util.concurrent.TransferQueue;

public class HMain1 {
    public static void getN(HashSet<Integer> hashSet){
        for (int kk = 1048576; kk >2 ; kk--) {
            int n = kk;
            boolean isOk = false;
            for (int i = n / 2; i >= 1; i--) {
                int a = i;
                long w = (2 * a - 1)*(2*a-1) + 8*n;
                long k = (long)Math.sqrt(w);
                long m = k - 2 * a + 1;
                if (m < 0) continue;
                if (k*k !=w) {
                    continue;
                } else if (m % 2 != 0)
                    continue;
                else {
                    String ans = n + "=";
                    for (long j = 1; j <= m / 2; j++) {
                        if (j == 1) ans += (i+j-1);
                        else ans += "+" +  (i+j-1) ;
                    }
                    // System.out.println(ans);
                    isOk = true;
                    break;
                }
            }
            if (!isOk) hashSet.add(n);;
        }
    }

     static {
        HashSet<Integer> hashSet = new HashSet<>();
        getN(hashSet);
        System.out.println(hashSet.contains(111));
    }

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();


        boolean isOk = false;
        for (int i = n / 2; i >= 1; i--) {
            int a = i;
            long w = (2 * a - 1)*(2*a-1) + 8*n;
            long k = (long)Math.sqrt(w);
            long m = k - 2 * a + 1;
            if (m < 0) continue;
            if (k*k !=w) {
                continue;
            } else if (m % 2 != 0)
                continue;
            else {
                String ans = n + "=";
                for (long j = 1; j <= m / 2; j++) {
                    if (j == 1) ans += (i+j-1);
                    else ans += "+" +  (i+j-1) ;
                }
               // System.out.println(ans);
                isOk = true;
                break;
            }
        }
        if (!isOk) System.out.println( n + "N");;
    }



}
